光纤光栅技术与应用专题讲座(三) 第6讲 光纤光栅传感技术在土木工程中的应用

针对利用光纤光栅进行应变、温度等测量已经在土木工程中较为普遍这一现状,首先对光纤光栅传感技术进行应变、温度等测量的基本原理进行了描述,重点讨论了为满足耐久性、安装方便与温度自动补偿等需求光纤光栅传感器的封装技术,最后介绍了光纤光栅传感器在土木工程中实际应用的现状。     

基于改进Rao-Blackwellized粒子滤波的WSN被动目标跟踪

Rao-Blackwellized粒子滤波虽然适合系统状态包含线性高斯分量的非线性状态估计,但是由于其计算量较大,不适用于实时性较高的被动目标跟踪情况。针对Rao-Blackwellized粒子滤波的不足,提出了改进的Rao-Blackwellized粒子滤波算法用于WSN被动目标跟踪。新的算法由一个粒子滤波和一个卡尔曼滤波组成,在执行过程中,粒子滤波和卡尔曼滤波相互交换信息,并行运行。计算机仿真结果表明,新的算法能够更好地减少计算量,提高跟踪的实时性。     

A sequential scheduling problem with impatient jobs

There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λ_i before departing the system. The service time of customer i has distribution F_i, and on completion of service of customer i a positive reward r_i is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

抢险救灾非战争军事行动中应急资源调度网络的优化方法

抢险救灾非战争军事行动包括道路抢修和物资运输等任务,而这两类任务在灾后应急资源调度中存在关联性的影响,且面临路网结构可变及需求随机模糊等挑战,对此,提出了一种非确定性应急资源调度网络双层规划模型,设计了基于蒙特卡洛方法与遗传算法耦合的智能启发式求解策略.通过对典型情境下应急资源调度案例进行分析建模和数值求解,说明了该模型和算法的合理性和有效性.     

弹载星敏感器应用方案比较研究

简述了弹载星敏感器几种应用方案的原理,从视场大小、导航星等、观星方式、像元分辨率、三轴姿态精度、动态性能、惯性基准误差分离等方面分析、比较了各种方案的优缺点.除平台方案外,捷联星图方案和单(双)星方案的技术参数相当,动态性能均有待提高.星图方案较单(双)星方案在2个方面占优势:一是星图方案不要求调整星敏感器光轴对准导航星,星跟踪算法等技术能快速识别星图;二是星图方案可同时、连续观测6～8颗星,解算出弹体三轴姿态,可以采用先进的滤波技术准确地分离惯性基准误差.     

Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment

The ability to cope with uncertainty in dynamic scheduling environments is becoming an increasingly important issue. In such environments, any disruption in the production schedule will translate into a disturbance of the plans for several external activities as well. Hence, from a practical point of view, deviations between the planned and realized schedules are to be avoided as much as possible. The term stability refers to this concern. We propose a proactive approach to generate efficient and stable schedules for a job shop subject to processing time variability and random machine breakdowns. In our approach, efficiency is measured by the makespan, and the stability measure is the sum of the variances of the realized completion times. Because the calculation of the original measure is mathematically intractable, we develop a surrogate stability measure. The version of the problem with the surrogate stability measure is proven to be NP‐hard, even without machine breakdowns; a branch‐and‐bound algorithm is developed for this problem variant. A tabu search algorithm is proposed to handle larger instances of the problem with machine breakdowns. The results of extensive computational experiments indicate that the proposed algorithms are quite promising in performance. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

机载光电传感器视轴指向的智能辅助决策方法

机载光电传感器视轴应尽可能接近目标线,以缩小指向偏差而不使目标偏离传感器瞬时视场,飞行员在复杂的战场态势下进行视轴操控具有一定困难。针对该问题,提出了一种机载光电传感器视轴指向的智能辅助决策方法,该方法以传感器视轴指向的数学模型为基础,通过专家知识建立引导规则,完成目标与各传感器的配对;计算配对后的各传感器视轴指向偏差和偏差变化率,采用模糊控制算法得出视轴偏移率,引导各传感器视轴指向与之配对的目标。仿真结果表明了该方法能够合理引导各传感器视轴指向目标,并能将视轴指向偏差缩小在很小的范围。     

非晶丝GMI磁传感器信号的小波分析

当非晶丝巨磁阻抗效应( Giant Magneto-Impedance,GMI)磁探头输出数据的信噪比小于0时,常规的峰值检波方法难以检出真实信号.为此,提出了一种新的微弱信号检测方法,将非晶丝GMI磁探头的输出信号经放大、滤波和采样之后直接送入数字信号处理系统,利用小波变换方法提取微弱信号的特征,并利用相关分析法确定...     

基于Vague集的TOPSIS法求解目标优先级

针对传感器管理中目标—传感器配对出现的目标优先级求解问题,提出了一种基于Vague集的TOPSIS计算方法。在分析目标优先级的主要影响因素基础上,定义了各影响因素的影响系数。同时结合Vague集的TOPSIS法给出了目标优先级的计算步骤,为目标优先级求解提供了一种新途径。并结合仿真算例表明该方法的合理性与有效性。